Exact integration of height probabilities in the Abelian Sandpile Model

The height probabilities for the recurrent configurations in the Abelian Sandpile Model on the square lattice have analytic expressions, in terms of multidimensional quadratures. At first, these quantities have been evaluated numerically with high accuracy, and conjectured to be certain cubic rational-coefficient polynomials in 1/pi. Later their values have been determined by different methods. We revert to the direct derivation of these probabilities, by computing analytically the corresponding integrals. Yet another time, we confirm the predictions on the probabilities, and thus, as a corollary, the conjecture on the average height.Comment: 17 pages, added reference

An exactly solvable random satisfiability problem

We introduce a new model for the generation of random satisfiability problems. It is an extension of the hyper-SAT model of Ricci-Tersenghi, Weigt and Zecchina, which is a variant of the famous K-SAT model: it is extended to q-state variables and relates to a different choice of the statistical ensemble. The model has an exactly solvable statistic: the critical exponents and scaling functions of the SAT/UNSAT transition are calculable at zero temperature, with no need of replicas, also with exact finite-size corrections. We also introduce an exact duality of the model, and show an analogy of thermodynamic properties with the Random Energy Model of disordered spin systems theory. Relations with Error-Correcting Codes are also discussed.Comment: 31 pages, 1 figur

O(n) vector model at n=-1, -2 on random planar lattices: a direct combinatorial derivation

The O(n) vector model with logarithmic action on a lattice of coordination 3 is related to a gas of self-avoiding loops on the lattice. This formulation allows for analytical continuation in n: critical behaviour is found in the real interval [-2,2]. The solution of the model on random planar lattices, recovered by random matrices, also involves an analytic continuation in the number n of auxiliary matrices. Here we show that, in the two cases n=-1, -2, a combinatorial reformulation of the loop gas problem allows to achieve the random matrix solution with no need of this analytical continuation.Comment: 4 pages, 2 figure

Noncommutative determinants, Cauchy-Binet formulae, and Capelli-type identities II. Grassmann and quantum oscillator algebra representation

We prove that, for $X$, $Y$, $A$ and $B$ matrices with entries in a non-commutative ring such that $[X_{ij},Y_{k\ell}]=-A_{i\ell} B_{kj}$, satisfying suitable commutation relations (in particular, $X$ is a Manin matrix), the following identity holds: $\mathrm{coldet} X \mathrm{coldet} Y =$. Furthermore, if also $Y$ is a Manin matrix, $\mathrm{coldet} X \mathrm{coldet} Y =\int \mathcal{D}(\psi, \psi^{\dagger}) \exp [ \sum_{k \geq 0} \frac{1}{k+1} (\psi^{\dagger} A \psi)^{k} (\psi^{\dagger} X B^k Y \psi) ]$. Notations: $< 0 |$, $| 0 >$, are respectively the bra and the ket of the ground state, $a^{\dagger}$ and $a$ the creation and annihilation operators of a quantum harmonic oscillator, while $\psi^{\dagger}_i$ and $\psi_i$ are Grassmann variables in a Berezin integral. These results should be seen as a generalization of the classical Cauchy-Binet formula, in which $A$ and $B$ are null matrices, and of the non-commutative generalization, the Capelli identity, in which $A$ and $B$ are identity matrices and $[X_{ij},X_{k\ell}]=[Y_{ij},Y_{k\ell}]=0$.Comment: 40 page

The complexity of the Multiple Pattern Matching Problem for random strings

We generalise a multiple string pattern matching algorithm, recently proposed by Fredriksson and Grabowski [J. Discr. Alg. 7, 2009], to deal with arbitrary dictionaries on an alphabet of size $s$. If $r_m$ is the number of words of length $m$ in the dictionary, and $\phi(r) = \max_m \ln(s\, m\, r_m)/m$, the complexity rate for the string characters to be read by this algorithm is at most $\kappa_{{}_\textrm{UB}}\, \phi(r)$ for some constant $\kappa_{{}_\textrm{UB}}$. On the other side, we generalise the classical lower bound of Yao [SIAM J. Comput. 8, 1979], for the problem with a single pattern, to deal with arbitrary dictionaries, and determine it to be at least $\kappa_{{}_\textrm{LB}}\, \phi(r)$. This proves the optimality of the algorithm, improving and correcting previous claims.Comment: 25 pages, 4 figure